Δ-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming

This paper introduces $\Delta$-MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA's Deep Space Network (DSN) scheduling problem. work is an extension our original MILP (DOI:10.1109/ACCESS.2021.3064928) and inherits many its constructions strengths, including base formulation for DSN scheduling. To provide more feasible schedules with respect requirements, $\Delta$-MILP incorporates new sets constraints 1) splitting larger tracks into shorter segments 2) preventing overlapping between on different antennas. Additionally, leverages heuristic balance mission satisfaction allows prioritize certain missions in special scenarios emergencies landings. Numerical validations demonstrate that now satisfies 100% requested provides fair amongst state-of-the-art most oversubscribed weeks years 2016 2018.